Low-Latency Elliptic Curve Scalar Multiplication

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast GPGPU-Based Elliptic Curve Scalar Multiplication

This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a General-Purpose computing on Graphics Processing Units (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255-bit prime eld complying with the new 128-bit security level, computes the scalar multiplication in less than a microsecond on...

متن کامل

Atomicity Improvement for Elliptic Curve Scalar Multiplication

Abstract. In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against side-channel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar multiplication designers and we point out that some of them are not relevant in the context of embedded devices. We then describe the state-of-the-art of at...

متن کامل

Elliptic Curve Cryptosystems and Scalar Multiplication

One of the most used cryptosystems in the world is the RSA system. Its popularity is due to its high security level. In the last decades, the studies have shown that the cryptosystems based on elliptic curves have the same security level as the RSA system. Besides that, the elliptic curve cryptosystems have a higher efficiency and they use shorter keys. In this paper we describe basics of the e...

متن کامل

New Fault Attack on Elliptic Curve Scalar Multiplication

In this report we present a new fault attack that applies to some implementations of elliptic curve scalar multiplication (ECSM). We consider the fault model with 'precise control of time', 'loose control of fault location' and 'random number of faulty bits'. We show that in this fault model the secret key can be revealed with polynomial time complexity and linear number of faults. In addition,...

متن کامل

An Efficient Elliptic Curve Scalar Multiplication using Karatsuba Multiplier

In this era, network security is becoming a great concern .Cryptography offers high security for communication and networking. Elliptic Curve Cryptography is gaining attraction with their high level of security with low cost, small key size and smaller hardware realization. Elliptic curve scalar multiplication is the most important operation in elliptic curve cryptosystems This paper develops a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Parallel Programming

سال: 2012

ISSN: 0885-7458,1573-7640

DOI: 10.1007/s10766-012-0198-5